Minimum volume semialgebraic sets for robust estimation
نویسندگان
چکیده
Motivated by problems of uncertainty propagation and robust estimation we are interested in computing a polynomial sublevel set of fixed degree and minimum volume that contains a given semialgebraic set K. At this level of generality this problem is not tractable, even though it becomes convex e.g. when restricted to nonnegative homogeneous polynomials. Our contribution is to describe and justify a tractable L1-norm or trace heuristic for this problem, relying upon hierarchies of linear matrix inequality (LMI) relaxations when K is semialgebraic, and simplifying to linear programming (LP) when K is a collection of samples, a discrete union of points.
منابع مشابه
Metric Properties of Semialgebraic Mappings
We give an effective estimation from above for the local Łojasiewicz exponent for separation of semialgebraic sets and for a semialgebraic mapping on a closed semialgebraic set. We also give an effective estimation from below of the Łojasiewicz exponent in the global separation for semialgebraic sets and estimation of the Łojasiewicz exponent at infinity of a semialgebraic mapping similar to th...
متن کاملMinimizing Polynomials Over Semialgebraic Sets
This paper concerns a method for finding the minimum of a polynomial on a semialgebraic set, i.e., a set in R defined by finitely many polynomial equations and inequalities, using the Karush-Kuhn-Tucker (KKT) system and sum of squares (SOS) relaxations. This generalizes results in the recent paper [15], which considers minimizing polynomials on algebraic sets, i.e., sets in R defined by finitel...
متن کاملSimple Approximations of Semialgebraic Sets and their Applications to Control
Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance the solution set of linear matrix inequalities or the Schur/Hurwitz stability domains. These sets often have very complicated shapes (non-convex, and even n...
متن کاملOn the minimum of a polynomial function on a basic closed semialgebraic set and applications
We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is not zero. As an application, we obtain a lower bound for the separation of two disjoint connected components of basic closed semialgebraic sets, when at least ...
متن کاملUnbounded Convex Semialgebraic Sets as Spectrahedral Shadows
Recently, Helton and Nie [3] showed that a compact convex semialgebraic set S is a spectrahedral shadow if the boundary of S is nonsingular and has positive curvature. In this paper, we generalize their result to unbounded sets, and also study the effect of the perspective transform on singularities.
متن کامل